Static Security Enhancement and Loss Minimization Using Simulated Annealing
نویسندگان
چکیده
منابع مشابه
A Simulated Annealing Based Inexact Oracle for Wasserstein Loss Minimization
Learning under a Wasserstein loss, a.k.a. Wasserstein loss minimization (WLM), is an emerging research topic for gaining insights from a large set of structured objects. Despite being conceptually simple, WLM problems are computationally challenging because they involve minimizing over functions of quantities (i.e. Wasserstein distances) that themselves require numerical algorithms to compute. ...
متن کاملTransaction Cost Function Minimization Using Simulated Annealing and Smoothing
Transaction cost function minimization is an important problem in finance. In this essay, we develop and apply a simulated annealing and smoothing method to this particular problem. We illustrate that this method is an improvement over using the trust-region method or simulated annealing algorithm alone. We will provide examples in different dimensions and using different parameter settings to ...
متن کاملSimulated Annealing based VLSI Circuit Partitioning for Delay Minimization
In this work two way partitioning of a circuit represented as a graph, is made using simulated annealing procedure and delay between the partitions is minimized. The various parameters used in the annealing process like initial temperature, cooling rate, and the threshold, given as a number of calculations , are changed and its influence on the delay between the partitions is discussed. Procedu...
متن کاملAn improved simulated annealing algorithm for bandwidth minimization
In this paper, a simulated annealing algorithm is presented for the bandwidth minimization problem for graphs. This algorithm is based on three distinguished features including an original internal representation of solutions, a highly discriminating evaluation function and an effective neighborhood. The algorithm is evaluated on a set of 113 well-known benchmark instances of the literature and...
متن کاملSimulated Annealing Approach to Crosstalk Minimization in Gridded Channel Routing
The inter-wire spacing in a VLSI chip becomes closer as the VLSI fabrication technology rapidly evolves. Accordingly, it becomes important to minimize crosstalk caused by the coupling capacitance between adjacent wires in the layout design for the fast and safe VLSI circuits. We present a simulated annealing approach based on segment rearrangement to crosstalk minimization in an initially gridd...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Intelligent Systems and Applications
سال: 2013
ISSN: 2074-904X,2074-9058
DOI: 10.5815/ijisa.2013.04.03